XCRUSH: A Family of ARX Block Ciphers

نویسنده

  • Evan Saulpaugh
چکیده

The XCRUSH family of non-Feistel, ARX block ciphers is designed to make efficient use of modern 64-bit general-purpose processors using a small number of encryption rounds which are simple to implement in software. The avalanche function, which applies one data-dependent, key-dependent rotation per 64-bit word of plaintext per round, allows XCRUSH to produce an almost totally diffuse 256-bit block after just the first two rounds. Designed for speed in software, the reference implementation for 3-round XCRUSH is measured at ∼7.3 cycles/byte single-threaded on an Intel Haswell processor. A deterministic random bit generator, constructed using the avalanche function, serves as a key scheduling algorithm. No security claims are made in this paper.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

MILP-Based Automatic Search Algorithms for Differential and Linear Trails for Speck

In recent years, Mixed Integer Linear Programming (MILP) has been successfully applied in searching for differential characteristics and linear approximations in block ciphers and has produced the significant results for some ciphers such as SIMON (a family of lightweight and hardware-optimized block ciphers designed by NSA) etc. However, in the literature, the MILP-based automatic search algor...

متن کامل

An Easy to Use Tool for Rotational-XOR Cryptanalysis of ARX Block Ciphers

An increasing number of lightweight cryptographic primitives have been published in the last years. Some of these proposals only use additions, rotations and XORs, and these ARX primitives have shown a great performance in software. In this paper, a computer tool to automate the security evaluation of ARX block ciphers is shown. Our tool takes a Python implementation of an ARX block cipher and ...

متن کامل

Automatic Search for the Best Trails in ARX: Application to Block Cipher Speck

We propose the first adaptation of Matsui’s algorithm for finding the best differential and linear trails to the class of ARX ciphers. It is based on a branch-and-bound search strategy, does not use any heuristics and returns optimal results. The practical application of the new algorithm is demonstrated on reduced round variants of block ciphers from the Speck family. More specifically, we rep...

متن کامل

Design Strategies for ARX with Provable Bounds: Sparx and LAX

We present, for the first time, a general strategy for designing ARX symmetric-key primitives with provable resistance against singletrail differential and linear cryptanalysis. The latter has been a long standing open problem in the area of ARX design. The wide trail design strategy (WTS), that is at the basis of many S-box based ciphers, including the AES, is not suitable for ARX designs due ...

متن کامل

Automatic Search for Differential Trails in ARX Ciphers

We propose a tool 1 for automatic search for differential trails in ARX ciphers. By introducing the concept of a partial difference distribution table (pDDT) we extend Matsui’s algorithm, originally proposed for DES-like ciphers, to the class of ARX ciphers. To the best of our knowledge this is the first application of Matsui’s algorithm to ciphers that do not have S-boxes. The tool is applied ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1509.02584  شماره 

صفحات  -

تاریخ انتشار 2015